LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY
نویسندگان
چکیده
منابع مشابه
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs"
The aim of this note is to present some counterexamples to the results in the paper by Du, Lyuu and Hsu published in this Transactions 1]. We present in this paper, for any d 2, a digraph G 2 L (d; 4) \ L (d ? 1; 4) such that LG 6 2 L (d ? 1; 5) and L 2 G 6 2 L (d; 6). Therefore, this is a counterexample to Lemma 3.2 and Theorem 3.3 of 1]. The digraphs we consider here are members of a family o...
متن کاملNew bounds on the diameter vulnerability of iterated line digraphs
Iterated line digraphs have some good properties in relation to the design of interconnection networks. The diameter vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a ,xed number of vertices or arcs. This parameter is related to the fault-tolerance of interconnection networks. In this work, we introduce some new parameters in order to ,nd new bounds fo...
متن کاملAlgebraic properties of a digraph and its line digraph
Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. Besides, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows to relate properties of G and LG regarding the number of cycles of a given length.
متن کاملIndependent restricted domination and the line digraph
Let H be a digraph possibly with loops and let D be a digraph whose arcs are colored with the vertices of H (an H-colored digraph). A walk (path) P in D will be called an H-restricted walk (path) if the colors displayed on the arcs of P form a walk in H. An H-restricted kernel N is a set of vertices of D such that for every two different vertices in N there is no H-restricted path in D joining ...
متن کاملDiameter vulnerability of GC graphs
Concern over fault tolerance in the design of interconnection networks has stimulated interest in finding large graphs with maximum degree ∆ and diameter D such that the subgraphs obtained by deleting any set of s vertices have diameter at most D′, this value being close to D or even equal to it. This is the so-called (∆, D, D′, s)-problem. The purpose of this work has been to study this proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 1999
ISSN: 1027-5487
DOI: 10.11650/twjm/1500407128